The Edge-Count Criterion for Graphic Lists
نویسندگان
چکیده
We give a new short proof of Koren’s characterization of graphic lists, extended to multigraphs with bounded multiplicity p, called p-graphs. The Edge-Count Criterion (ECC) for an integer n-tuple d and integer p is the statement that for all disjoint sets I and J of indices, ∑
منابع مشابه
Profit intensity criterion for transportation problems
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملGraphic and Protographic Lists of Integers
A positive list (list of positive integers) is protographic if its merger with all but finitely many positive graphic lists is graphic. Define the family Ps of s-protogaphic lists by letting P0 be the family of positive graphic lists and letting Ps for s > 0 be the family of positive lists whose merger with all but finitely many lists in Ps−1 is in Ps−1. The main result is that X ∈ Ps if and on...
متن کاملOn the existence of super edge-connected graphs with prescribed degrees
Let G be a connected graph of order n, minimum degree δ(G), and edge-connectivity κ (G). The graph G ismaximally edge-connected if κ (G) = δ(G) and super edge-connected if every minimum edge-cut consists of edges incident with a vertex of minimum degree. A list (d1, . . . , dn) is graphic if there is a graph with vertices v1, . . . , vn such that d(vi) = di for 1 ≤ i ≤ n. A graphic list D is su...
متن کاملEnglish Vocabulary for Equine Veterans: How Different from GSL and AWL Words
ESP students are usually suggested to master general and academic word lists such as Wests’ (1953) General Service List (GSL) and Coxhead’s (2000) Academic Word List (AWL) to be able to read their academic texts. However, it seems that university students may not need to learn all the words in the two lists as some words in the lists are of less frequency in academic texts. Moreover, there are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010